Graph based Synthesis for Low power Combinational logic with a maximal/minimal disjoint Function Set ABSTRACT This paper discusses a new, systematic approach to the synthesis of a class of non-regenerative Boolean networ

Source URL: apt.cs.manchester.ac.uk

Programmatic and Direct Manipulation, Together at Last Ravi Chugh Brian Hempel Mitchell Spradlin

Source URL: arxiv.org

• Mathematics
• Algebraic logic
• Boolean algebra
• Function
• Equation solving
• Expected value
• Parameter
• Equation

Boolean Logic Building a Modern Computer From First Principles www.nand2tetris.org Elements of Computing Systems, Nisan & Schocken, MIT Press, www.nand2tetris.org , Chapter 1: Boolean Logic

Source URL: nand2tetris.org

• Mathematics
• Logic gates
• Digital circuits
• AND gate
• OR gate
• Boolean function
• Multiplexer
• Negated AND gate
• Boolean algebras canonically defined
• Mathematical logic
• Boolean algebra
• Algebraic logic

Dynamical systems analysis of stack filters Matti Nykter1,2 , Juha Kesseli3,2, Ilya Shmulevich1 1 Institute for Systems Biology, Seattle, WA, 98103, USA of Signal Processing, Tampere University of Technology,

Source URL: www.cs.tut.fi

• Electronic engineering
• Boolean algebra
• Logic
• Linear filter
• Artificial neuron
• Boolean network
• Filter
• Monotonic function
• Electronic filter
• Mathematics
• Mathematical analysis
• Filter theory

Microsoft Word - PiecewiseLinCombined32.doc

Source URL: ticsp.cs.tut.fi

• Implicant
• Binary decision diagram
• Function
• Polynomial
• Vector space
• Constructible universe
• Mathematics
• Algebra
• Boolean algebra

Verifying Relative Error Bounds using Symbolic Simulation Jesse Bingham and Joe Leslie-Hurd Intel Corporation, Hillsboro, U.S.A

Source URL: www.gilith.com

• Function
• FO
• Boolean algebra
• Mathematics
• Floor and ceiling functions
• Mathematical notation

Collections, Cardinalities, and Relations Kuat Yessenov1⋆ , Ruzica Piskac2 , and Viktor Kuncak2⋆⋆ 1 2

Source URL: lara.epfl.ch

• Model theory
• Electronic design automation
• Logic in computer science
• NP-complete problems
• First-order logic
• Function
• Interpretation
• FO
• Boolean satisfiability problem
• Mathematics
• Logic
• Mathematical logic

Symbolic Resource Bound Inference for Functional Programs Ravichandhran Madhavan1 and Viktor Kuncak2 1 2

Source URL: lara.epfl.ch

• Formal methods
• Electronic design automation
• Logic in computer science
• NP-complete problems
• Model theory
• Function
• Boolean satisfiability problem
• Structure
• Parameter
• Mathematics
• Theoretical computer science
• Mathematical logic

Certificates of Non-Membership for Classes of Read-Once Functions Dmitry Chistikov1? , Valentina Fedorova2 , and Andrey Voronenko2 1 Max Planck Institute for Software Systems (MPI-SWS), Germany

Source URL: www.mpi-sws.org

• Function
• Boolean algebra
• Artificial neuron
• Numerical software
• GEC
• Propositional directed acyclic graph
• Mathematics
• Functions and mappings
• Mathematical logic

Chapter 1 Introduction Let f be Boolean function from nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str

Source URL: www.nada.kth.se

• Circuit complexity
• Complexity classes
• Parity function
• ACC0
• Switching lemma
• NC
• Clique problem
• Boolean circuit
• Circuit
• Theoretical computer science
• Computational complexity theory
• Applied mathematics